On 3-cut reductions of minimally 1-factorable cubic bigraphs
نویسندگان
چکیده
منابع مشابه
On determinants and permanents of minimally 1-factorable cubic bipartite graphs
A minimally 1-factorable cubic bigraph is a graph in which every 1-factor lies in precisely one 1-factorization. The author investigates determinants and permanents of such graphs and, in particular, proves that the determinant of any minimally 1-factorable cubic bigraph of girth 4 is 0.
متن کاملA new Description of Perfectly One-factorable Cubic Graphs
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into one-factors such that the union of any two of them is a Hamiltonian cycle. The case of cubic graphs is treated. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. A description of this class was obtained by Kotzig in 1962. It is the purpose of t...
متن کاملOn max cut in cubic graphs
This paper is concerned with the maximum cut problem in parallel on cubic graphs. New theoretical results characterizing the cardinality of the cut are presented. These results make it possible to design a simple combinatorial O(log n) time parallel algorithm , running on a CRCW PRAM with O(n) processors. The approximation ratio achieved by the algorithm is 1: 3 and improves the best known para...
متن کاملOn Path Factors of (3, 4)-Biregular Bigraphs
A (3, 4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning subgraph whose components are nontrivial paths. We prove that a simple (3, 4)-biregular bigraph always has a path factor such that the endpoints of each path have degree three. Moreover we suggest a polynomial algorithm...
متن کاملOn Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets
DP-reduction F ❀ DPv(F ), applied to a clause-set F and a variable v, replaces all clauses containing v by their resolvents (on v). A basic case, where the number of clauses is decreased (i.e., c(DPv(F )) < c(F )), is singular DP-reduction (sDP-reduction), where v must occur in one polarity only once. For minimally unsatisfiable F ∈ MU , sDPreduction produces another F ′ := DPv(F ) ∈ MU with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00327-7